Extending Conceptual Logic Programs with Arbitrary Rules
نویسندگان
چکیده
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more expressive in the sense that they enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web.
منابع مشابه
Semantic Web Reasoning with Conceptual Logic Programs
We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while carefully guarding useful knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting Conceptual Logic Programs can be reduced to finite, normal Answer Set Programming, for whi...
متن کاملAnalysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
In [4] a nonmonotonic formalism called partial equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in de ning a class of minimal models, called partial equilibrium (p-equilibrium), inside a non-classical logic called HT 2. In [4] it was shown that, on normal logic programs, p-equilibrium models coincide with Przymusin...
متن کاملCut-elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities ♦, , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with typical inference rules for the modalities used in display logics. As it turns out, the resulting calculus, LBiKt, seems to be more basic than most intui...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملExtensions of Answer Set Programming
We discuss a number of possible extensions of Answer Set Programming. The four formalisms we investigate are: 1. logic programs where the negative parts of the bodies in clauses can be replaced by arbitrary constraints which we call Arbitrary Constraint Logic Programming (ACLP), 2. logic programs where we are allowed arbitrary set constraint atoms, 3. logic programs where atoms represent sets f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005